首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9587篇
  免费   1220篇
  国内免费   628篇
化学   848篇
晶体学   14篇
力学   521篇
综合类   197篇
数学   7067篇
物理学   2788篇
  2024年   14篇
  2023年   137篇
  2022年   206篇
  2021年   195篇
  2020年   299篇
  2019年   329篇
  2018年   340篇
  2017年   335篇
  2016年   264篇
  2015年   213篇
  2014年   421篇
  2013年   775篇
  2012年   451篇
  2011年   608篇
  2010年   545篇
  2009年   753篇
  2008年   732篇
  2007年   609篇
  2006年   587篇
  2005年   452篇
  2004年   455篇
  2003年   390篇
  2002年   368篇
  2001年   313篇
  2000年   241篇
  1999年   212篇
  1998年   209篇
  1997年   161篇
  1996年   139篇
  1995年   119篇
  1994年   85篇
  1993年   76篇
  1992年   73篇
  1991年   44篇
  1990年   31篇
  1989年   37篇
  1988年   34篇
  1987年   22篇
  1986年   20篇
  1985年   29篇
  1984年   28篇
  1983年   10篇
  1982年   19篇
  1981年   13篇
  1980年   10篇
  1979年   7篇
  1978年   5篇
  1977年   7篇
  1975年   3篇
  1974年   3篇
排序方式: 共有10000条查询结果,搜索用时 437 毫秒
61.
We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?0‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel.  相似文献   
62.
In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree Δ is at least ◂⋅▸23(Δ+1) if Δ2, at least ◂+▸23Δ+1 if Δ8, and at least ◂⋅▸23(Δ+2) if Δ15. Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if Δ18 and Δ30, respectively.  相似文献   
63.
In this paper we study a Hamiltonian function on the cotangent bundle of the space of Riemannian metrics on a 3-manifold M and prove the orbits of the constrained Hamiltonian dynamical system correspond to G2-manifolds foliated by hypersurfaces diffeomorphic to M×SO(3).  相似文献   
64.
We provide two new constructions for pairs of mutually orthogonal symmetric hamiltonian double Latin squares. The first is a tripling construction, and the second is derived from known constructions of hamilton cycle decompositions of when is prime.  相似文献   
65.
Heavy metal ions are harmful to aquatic life and humans owing to their high toxicity and non‐biodegradability, so their removal from wastewater is an important task. Therefore, this work focuses on designing suitable, simple and economical nanosensors to detect and remove these metal ions with high selectivity and sensitivity. Based on this idea, different types of mesoporous materials such as hexagonal SBA‐15, cubic SBA‐16 and spherical MCM‐41, their chloro‐functionalized derivatives, as well as 4‐(4‐nitro‐phenylazo)‐naphthalen‐1‐ol (NPAN) azo dye have been synthesized, with the aim of designing some optical nanosensors for metal ions sensing applications. The mentioned azo dye has been anchored into the chloro‐functionalized mesoporous materials. The designed nanosensors were characterized using scanning and transmission electron microscopy as well as Fourier transform infrared and UV–visible spectral analysis, nitrogen adsorption–desorption isotherms, low‐angle X‐ray diffraction and thermogravimetric analyses. Their optical sensing to various toxic metal ions such as Cd (II), Hg (II), Mn (II), Fe (II), Zn (II) and Pb (II) at different values of pH (1.1, 4.9, 7 and 12) was investigated. The optimization of experimental conditions, including the effect of pH and metal ion concentration, was examined. The experimental results showed that the solution pH had a major impact on metal ion detection. The optical nanosensors respond well to the tested metal ions, as reflected by the enhancement in both absorption and emission spectra upon adding different concentrations of the metal salts and were fully reversible on adding ethylene diamine tetra acetic acid or citric acid to the formed complexes. High values of the binding constants for the designed nanosensors were observed at pHs 7 and 12, confirming the strong chelation of different metals to the nanosensor at these pHs. Also, high binding constants and sensitivity were observed for NPAN‐MCM‐41 as a nanosensor to detect the different metal ions. From the obtained results, we succeeded in transforming the harmful azo dye into an environmentally friendly form via designing of the optical nanosensors used to detect toxic metal ions in wastewater with high sensitivity.  相似文献   
66.
Kreweras conjectured that every perfect matching of a hypercube Qn for n2 can be extended to a hamiltonian cycle of Qn. Fink confirmed the conjecture to be true. It is more general to ask whether every perfect matching of Qn for n2 can be extended to two or more hamiltonian cycles of Qn. In this paper, we prove that every perfect matching of Qn for n4 can be extended to at least 22n?4 different hamiltonian cycles of Qn.  相似文献   
67.
We will focus on the existence of nontrivial solutions to the following Hamiltonian elliptic system where are numbers belonging to the interval [0, 2), V is a continuous potential bounded below on by a positive constant and the functions f and g possess exponential growth range established by Trudinger–Moser inequalities in Lorentz–Sobolev spaces. The proof involves linking theorem and a finite‐dimensional approximation.  相似文献   
68.
Medical treatment and vaccination decisions are often sequential and uncertain. Markov decision process is an appropriate means to model and handle such stochastic dynamic decisions. This paper studies the near‐optimality of a stochastic SIRS epidemic model that incorporates vaccination and saturated treatment with regime switching. The stochastic model takes white noises and color noise into account. We first prove some priori estimates of the susceptible, infected, and recovered populations. Moreover, we establish some sufficient and necessary conditions of the near‐optimality by Pontryagin stochastic maximum principle. Our results show that the two kinds of environmental noises have great impacts on the infectious diseases. Finally, we illustrate our conclusions through numerical simulations.  相似文献   
69.
Let mnk. An m × n × k 0‐1 array is a Latin box if it contains exactly m n ones, and has at most one 1 in each line. As a special case, Latin boxes in which m = n = k are equivalent to Latin squares. Let be the distribution on m × n × k 0‐1 arrays where each entry is 1 with probability p, independently of the other entries. The threshold question for Latin squares asks when contains a Latin square with high probability. More generally, when does support a Latin box with high probability? Let ε > 0. We give an asymptotically tight answer to this question in the special cases where n = k and , and where n = m and . In both cases, the threshold probability is . This implies threshold results for Latin rectangles and proper edge‐colorings of Kn,n.  相似文献   
70.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号